An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

摘要

An optimal solution to the problem of scheduling real-time tasks on a set ofidentical processors is derived. The described approach is based on solving anequivalent uniprocessor real-time scheduling problem. Although there are otherscheduling algorithms that achieve optimality, they usually impose prohibitivepreemption costs. Unlike these algorithms, it is observed through simulationthat the proposed approach produces no more than three preemptions points perjob.